Nearest-Neighbor Walks With Low Predictability Profile and Percolation in 2+ε Dimensions
نویسندگان
چکیده
A few years ago, Grimmett, Kesten and Zhang proved that for supercritical bond percolation on Z3, simple random walk on the infinite cluster is a.s. transient. We generalize this result to a class of wedges in Z3 including, for any ε ε (0,1), the wedge Wε={(x,y,z) ε Z3 : x ≥ 0, |z| ≤ x ε} which can be thought of as representing a (2 + ε)-dimensional lattice. Our proof builds on recent work of Benjamini, Pemantle and Peres, and involves the construction of finite-energy flows using nearest-neighbor walks on Z with low predictability profile. Along the way, we obtain some new results on attainable decay rates for predictability profiles of nearest-neighbor walks.
منابع مشابه
Nearest-neighbor Walks with Low Predictability Proole and Percolation in 2 + " Dimensions
A few years ago, Grimmett, Kesten and Zhang proved that for supercritical bond percolation on Z 3 , simple random walk on the innnite cluster is a.s. transient. We generalize this result to a class of wedges in Z 3 including, for any " 2 (0; 1), the wedge W " = f(x; y; z) 2 Z 3 : x 0; jzj x " g which can be thought of as representing a (2 + ")-dimensional lattice. Our proof builds on recent wor...
متن کاملApproximate line nearest neighbor in high dimensions
We consider the problem of approximate nearest neighbors in high dimensions, when the queries are lines. In this problem, given n points in R, we want to construct a data structure to support efficiently the following queries: given a line L, report the point p closest to L. This problem generalizes the more familiar nearest neighbor problem. From a practical perspective, lines, and low-dimensi...
متن کاملDecay of Correlations in Nearest - Neighbor Self - Avoiding Walk , Percolation , Lattice Trees and Animals
We consider nearest-neighbor self-avoiding walk, bond percolation, lattice trees, and bond lattice animals on Z. The two-point functions of these models are respectively the generating function for self-avoiding walks from the origin to x ∈ Z, the probability of a connection from the origin to x, and the generating functions for lattice trees or lattice animals containing the origin and x. Usin...
متن کاملApplications of Chebyshev Polynomials to Low-Dimensional Computational Geometry
We apply the polynomial method—specifically, Chebyshev polynomials—to obtain a number of new results on geometric approximation algorithms in low constant dimensions. For example, we give an algorithm for constructing ε-kernels (coresets for approximate width and approximate convex hull) in close to optimal time O(n + (1/ε)(d−1)/2), up to a small near-(1/ε)3/2 factor, for any d-dimensional n-po...
متن کاملA percolation explanation for the ± J spin-glass critical temperature
We present a simple procedure using invasion percolation for estimating the critical temperatures of the +J nearest neighbor spin glass in two, three and four dimensions. The
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998